منابع مشابه
Hardness of conjugacy, embedding and factorization of multidimensional subshifts
Subshifts of finite type are sets of colorings of the plane defined by local constraints. They can be seen as a discretization of continuous dynamical systems. We investigate here the hardness of deciding factorization, conjugacy and embedding of subshifts in dimensions d > 1 for subshifts of finite type and sofic shifts and in dimensions d ≥ 1 for effective shifts. In particular, we prove that...
متن کاملuniform distribution theory MULTIDIMENSIONAL EFFECTIVE S - ADIC SUBSHIFTS ARE SOFIC
In this article we prove that multidimensional effective S-adic systems, obtained by applying an effective sequence of substitutions chosen among a finite set of substitutions, are sofic subshifts. Communicated by Pierre Liardet
متن کاملHardness of conjugacy and factorization of multidimensional subshifts of finite type
We investigate here the hardness of conjugacy and factorization of subshifts of finite type (SFTs) in dimension d > 1. In particular, we prove that the factorization problem is Σ3-complete and the conjugacy problem Σ1-complete in the arithmetical hierarchy.
متن کاملHardness of Conjugacy, Embedding and Factorization of multidimensional Subshifts of Finite Type
Subshifts of finite type are sets of colorings of the plane defined by local constraints. They can be seen as a discretization of continuous dynamical systems. We investigate here the hardness of deciding factorization, conjugacy and embedding of subshifts of finite type (SFTs) in dimension d > 1. In particular, we prove that the factorization problem is Σ3-complete and that the conjugacy and e...
متن کاملOn Lambda-graph Systems for Subshifts of Subshifts
Kengo Matsumoto has introduced λ-graph systems and strong shift equivalence of λ-graph systems [Doc.Math.4 (1999), 285-340]. We associate to a subshift of a subshift a λ-graph system. The strong shift equivalence class of the associated λ-graph system is an invariant of subsystem equivalence. Wolfgang Krieger and Kengo Matsumoto have introduced the λ-entropy of a λ-graph system and have shown i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2019
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-019-09931-1